class Solution 
{
public:
    int uniquePaths(int m, int n) 
    {
        const int x = 101;
        int dp[x][x] = {0};
        dp[0][1] = 1;
        for(int i = 1;i <= m;i++)
        {
            for(int j = 1; j <= n;j++)
            {
                dp[i][j] = dp[i-1][j]+dp[i][j-1];
            }
        }
        return dp[m][n];
    }
};
